import java.util.HashMap;
import java.util.Map;

public class P47 {
	public static void main(String[] args) throws Exception {
		int n = 4;
		
		Map<Long, Long> primeFactorMap = new HashMap<Long, Long>();
		
		for (long i = 1; true; i++) {
			if (i >= n) {
				
				System.out.println(i);
				
				boolean isConsecutive = true;
				
				//System.out.println(i + ":" + Util.primeFactor(i));
				
				Map<Long, Long> p = Util.primeFactor(i);
				if (p.size() == n) {
					primeFactorMap.put(i, (long) p.size());	
					for (long j = 1; j < n; j++) {
						Long size = primeFactorMap.get(i - j);
						if (size == null || size != n) {
							isConsecutive = false;
							break;
						}					
					}
					
					if (isConsecutive) {
						for (long j = 0; j < n; j++) {
							System.out.println(i - j + ":" + Util.primeFactor(i - j));					
						}	
						break;
					}
				}
			}
			
			//Thread.sleep(1000);
		}
	}
}
